Efficiency Gains from Time Refinement on AMR Meshes and Explicit Timestepping

نویسنده

  • L. J. Dursi
چکیده

Block-structured AMR meshes are often used in astrophysical fluid simulations, where the geometry of the domain is simple. We consider potential efficiency gains for time sub-cycling, or time refinement (TR), on Berger-Collela and oct-tree AMR meshes for explicit or local physics (such as explict hydrodynamics), where the work per block is roughly constant with level of refinement. We note that there are generally many more fine zones than there are coarse zones. We then quantify the natural result that any overall efficiency gains from reducing the amount of work on the relatively few coarse zones must necessarily be fairly small. Potential efficiency benefits from TR on these meshes are seen to be quite limited except in the case of refining a small number of points on a large mesh — in this case, the benefit can be made arbitrarily large, albeit at the expense of spatial refinement efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Dimensional Discontinuous Galerkin Methods for Euler Equations on the Adaptive Consistent Meshes

In the numerical simulation of three dimensional fluid dynamical equations, the huge computational quantity is a main challenge problem. Based on the three dimensional consistent unstructured tetrahedron meshes, we study the discontinuous Galerkin (DG) finite element method [1] combined with the adaptive mesh refinement (AMR) [2, 3] for solving Euler equations in this paper. That is according t...

متن کامل

Dynamic Adaptive Mesh Refinement for Topology Optimization

We present an improved method for topology optimization with both adaptive mesh refinement and derefinement. Since the total volume fraction in topology optimization is usually modest, after a few initial iterations the domain of computation is largely void. Hence, it is inefficient to have many small elements, in such regions, that contribute significantly to the overall computational cost but...

متن کامل

Dendritic Meshing *

A mesh is said to be dendritic if it contains elements with mid-side (edge) nodes when the predominant element topology has only corner nodes. A dendritic mesh is illustrated in Figure 1 where the predominant element is a four-node quadrilateral, but has also several five-node quadrilateral elements each with one mid-edge node plus four corner nodes. Such meshes arise when an approximately unif...

متن کامل

Compact integration factor methods for complex domains and adaptive mesh refinement

Implicit integration factor (IIF) method, a class of efficient semi-implicit temporal scheme, was introduced recently for stiff reaction-diffusion equations. To reduce cost of IIF, compact implicit integration factor (cIIF) method was later developed for efficient storage and calculation of exponential matrices associated with the diffusion operators in two and three spatial dimensions for Cart...

متن کامل

Topology optimization with adaptive mesh refinement

We outline a robust method for topology optimization with adaptive mesh refinement and derefinement (AMR). Since the total volume fraction in topology optimization is usually modest, after a few initial iterations the domain of computation is largely void. It is inefficient to have many small elements in such regions, as these contribute significantly to the overall computational cost but littl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005